Computational Complexity in Analysis
نویسنده
چکیده
In this paper we will introduce well motivated definitions of computational complexity on type-2 objects. Similar to the model of Kawamura and Cook (and earlier models) our models will be both based on classical Turing machines and the notion of representations. The main differences to the model of Kawamura and Cook is that we give up type-2-polynomials and, additionally, use parameter based type-2 complexity which was in-
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملرفع نوفه ویدئو توسط تبدیل قیچک قطعهای
Parabolic scaling and anisotropic dilation form the core of famous multi-resolution transformations such as curvelet and shearlet, which are widely used in signal processing applications like denoising. These non-adaptive geometrical wavelets are commonly used to extract structures and geometrical features of multi-dimensional signals and preserve them in noise removal treatments. In discrete s...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملA new approach to determine efficient DMUs in DEA models using inverse optimization
This paper proposes a new approach for determining efficient DMUs in DEA models using inverse optimi-zation and without solving any LPs. It is shown that how a two-phase algorithm can be applied to detect effi-cient DMUs. It is important to compare computational performance of solving the simultaneous linear equa-tions with that of the LP, when computational issues and complexity analysis are a...
متن کامل